Turing tar-pit - définition. Qu'est-ce que Turing tar-pit
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Qu'est-ce (qui) est Turing tar-pit - définition

PROGRAMMING LANGUAGE OR COMPUTER INTERFACE THAT ALLOWS FOR FLEXIBILITY IN FUNCTION BUT IS DIFFICULT TO LEARN AND USE BECAUSE IT OFFERS LITTLE OR NO SUPPORT FOR COMMON TASKS
Turing tar pit; Touring tarpit

Turing tar-pit      
A place where anything is possible but nothing of interest is practical. Alan M. Turing helped lay the foundations of computer science by showing that all machines and languages capable of expressing a certain very primitive set of operations are logically equivalent in the kinds of computations they can carry out, and in principle have capabilities that differ only in speed from those of the most powerful and elegantly designed computers. However, no machine or language exactly matching Turing's primitive set has ever been built (other than possibly as a classroom exercise), because it would be horribly slow and far too painful to use. A "Turing tar-pit" is any computer language or other tool that shares this property. That is, it's theoretically universal but in practice, the harder you struggle to get any real work done, the deeper its inadequacies suck you in. Compare bondage-and-discipline language. A tar pit is a geological occurence where subterranean tar leaks to the surface, creating a large puddle (or pit) of tar. Animals wandering or falling in get stuck, being unable to extricate themselves from the tar. La Brea, California, has a museum built around the fossilized remains of mammals and birds found in such a tar pit. [Jargon File] (1998-06-27)
Turing tarpit         
A Turing tarpit (or Turing tar-pit) is any programming language or computer interface that allows for flexibility in function but is difficult to learn and use because it offers little or no support for common tasks. The phrase was coined in 1982 by Alan Perlis in the Epigrams on Programming:
Tar pit (disambiguation)         
WIKIMEDIA DISAMBIGUATION PAGE
Tarpit (computing); Tar Pit
A tar pit is a geological occurrence where subterranean bitumen leaks to the surface, creating a large puddle, pit, or lake of asphalt.

Wikipédia

Turing tarpit

A Turing tarpit (or Turing tar-pit) is any programming language or computer interface that allows for flexibility in function but is difficult to learn and use because it offers little or no support for common tasks. The phrase was coined in 1982 by Alan Perlis in the Epigrams on Programming:

54. Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy.

In any Turing complete language, it is possible to write any computer program, so in a very rigorous sense nearly all programming languages are equally capable. However, having that theoretical ability is not the same as usefulness in practice. Turing tarpits are characterized by having a simple abstract machine that requires the user to deal with many details in the solution of a problem. At the extreme opposite are interfaces that can perform very complex tasks with little human intervention but become obsolete if requirements change slightly.

Some esoteric programming languages, such as Brainfuck, are specifically referred to as "Turing tarpits" because they deliberately implement the minimum functionality necessary to be classified as Turing complete languages. Using such languages is a form of mathematical recreation: programmers can work out how to achieve basic programming constructs in an extremely difficult but mathematically Turing-equivalent language.